On the𝜀-ascent chromatic index of complete graphs
نویسندگان
چکیده
منابع مشابه
Exact Values for the ε-Ascent Chromatic Index of Complete Graphs
Following a problem introduced by Schurch [M. Schurch, On the Depression of Graphs, Doctoral Dissertation, University of Victoria, 2013], we find exact values of the minimum number of colours required to properly edge colour Kn, n ≥ 6, using natural numbers, such that the length of a shortest maximal path of increasing edge labels is equal to three. This result improves the result of Breytenbac...
متن کاملOn complete subgraphs of r-chromatic graphs
Let G,J n) be an r-chromatic graph with n vertices in each colour class . Suppose G = G 3 (n), and t (G) . the minimal degree in G, is at least n + t (t _> 1) . We prove that C contains at least t 3 triangles but does not have to contain more titan 4t 3 of them . Furthermore, we give lower bounds for s such that G contains a complete 3-partite graph with s vertices in each class . Let';.(ii) = ...
متن کاملOn Chromatic Uniqueness of Complete Complete 6-Partite Graphs
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs G with 6n + i vertices for i = 0, 1, 2 according to the number of 7-independent partitions o...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملComplete Subgraphs of Chromatic Graphs and Hypergraphs
In this note we consider k-chromatic graphs with given colour k r-graphs have vertex sets u C i , and no r-tuple (i .e. edge o f 1 the r-graph) has two vertices in the same colour class C i .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2015
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2015.8.295